Erratum: Constructing Optimal $k$-Radius Sequences
نویسندگان
چکیده
منابع مشابه
Constructing k-radius sequences
An n-ary k-radius sequence is a finite sequence of elements taken from an alphabet of size n such that any two distinct elements of the alphabet occur within distance k of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc to model a caching strategy for computing certain functions on large data sets such as medical images. Let fk(n) be the shortest leng...
متن کاملThe existence of k-radius sequences
Let n and k be positive integers, and let F be an alphabet of size n. A sequence over F of length m is a k-radius sequence if any two distinct elements of F occur within distance k of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc in 2004, in order to produce an efficient caching strategy when computing certain functions on large data sets such as me...
متن کاملSequences of Radius k for Complete Bipartite Graphs
A k-radius sequence for a graph G is a sequence of vertices of G (typically with repetitions) such that for every edge uv of G vertices u and v appear at least once within distance k in the sequence. The length of a shortest k-radius sequence for G is denoted by fk(G). We give an asymptotically tight estimation on fk(G) for complete bipartite graphs which matches a lower bound, valid for all bi...
متن کاملErratum to: Constructing Highly Incident Configurations
The paper “Constructing Highly Incident Configurations” contains a confusing typo in Sect. 4.2, proving the inductive step, Case 1: vertices. In this section, we wish to show that the set of vertices (v τ )i is well-defined. To do this, we need to show that for any g and h in τ , the previously constructed pairs of lines {(Lgτ )i , (Lgτ )i+tg} and {(Lhτ )i , (Lσ̂hτ )i+th} intersect in a single p...
متن کاملConstructing Optimal Highways
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the time needed to traverse a quickest path from p to q, where the distance is measured with speed v on h and with speed 1 in the underlying metric elsewhere. Given a set S of n points in the plane and a highway speed v, we co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m108505x